Infinite-duration Bidding Games
نویسندگان
چکیده
منابع مشابه
Infinite-Duration Bidding Games
Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study th...
متن کاملCapital Accumulation Games of Infinite Duration
Consider a market in which firms accumulate capital according to the Nerlove-Arrow capital accumulation equation. Each player chooses a path of investment and thus an induced path of capital to maximize his total discounted profits which depend on his own capital and the capital stocks of his rivals. Existence is proved for such a nonzero sum, infinite horizon differential game and conditions u...
متن کاملUncoercible e-Bidding Games
The notion of uncoercibility was first introduced in e-voting systems to deal with the coercion of voters. However this notion extends to many other esystems for which the privacy of users must be protected, even if the users wish to undermine their own privacy. In this paper we consider uncoercible e-bidding games. We discuss necessary requirements for uncoercibility, and present a general unc...
متن کاملDiscrete bidding games
We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences between discrete bidding games and Richman games, which allow real-valued bidding. Unlike Richman games, discrete bidding game variations of many familiar g...
متن کاملDiscrete All-Pay Bidding Games
In an all-pay auction, only one bidder wins but all bidders must pay the auctioneer. All-pay bidding games arise from attaching a similar bidding structure to traditional combinatorial games to determine which player moves next. In contrast to the established theory of single-pay bidding games, optimal play involves choosing bids from some probability distribution that will guarantee a minimum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2019
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3340295